Floyd–Warshall algorithm - PDFSEARCH.IO - Document Search Engine

Floyd–Warshall algorithm
Results: 32

#	Item
11	EVERYTHING IS BROKEN EXCEPT HOPE Eleanor Saitta @Dymaxion Add to Reading List Source URL: dymaxion.org Language: English - Date: 2015-03-06 09:52:27 Operations research Routing algorithms Network theory Shortest path problem Network flow Routing Flow network Floyd–Warshall algorithm Dynamic programming Mathematics Graph theory Theoretical computer science
12	Mobile Transit Trip Planning with Real–Time Data, J. Jariyasunant, D. Work, B. Kerkez, R. Sengupta, S. Glaser, and A. Bayen Transportation Research Board 89th Annual Meeting, Washington, D.C., Jan[removed], 2010. Mobile Add to Reading List Source URL: bayen.eecs.berkeley.edu Language: English - Date: 2015-01-21 14:55:55 Operations research Routing algorithms Network theory Shortest path problem Network flow Routing Flow network Floyd–Warshall algorithm Dynamic programming Mathematics Graph theory Theoretical computer science
13	Route Planning in Transportation Networks HANNAH BAST University of Freiburg DANIEL DELLING Microsoft Research Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-01-08 16:25:56 Routing algorithms Network theory Shortest path problem Distance Bellman–Ford algorithm Graph Centrality Floyd–Warshall algorithm Shortest path tree Mathematics Graph theory Theoretical computer science
14	To be published at the International Semantic Web Conference (ISWC[removed]The framework will be available for download on November 5, 2010. Signal/Collect: Graph Algorithms for the (Semantic) Web Philip Stutz1 , Abraham Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2010-09-20 15:08:34 Graph coloring Shortest path problem Factor graph Algorithm Vertex Distance Floyd–Warshall algorithm Path decomposition Graph theory Mathematics Theoretical computer science
15	The Design Principles of a Weighted Finite-State Transducer Library Mehryar Mohri, Fernando Pereira and Michael Riley AT&T Labs — Research 180 Park Avenue, Florham Park, NJ[removed] Add to Reading List Source URL: www.cs.mun.ca Language: English - Date: 2006-02-09 10:43:25 Applied mathematics Models of computation Finite state transducer Semiring Shortest path problem Algorithm Floyd–Warshall algorithm Powerset construction Theoretical computer science Automata theory Mathematics
16	A Faster Algorithm for Betweenness Centrality∗ Ulrik Brandes University of Konstanz Department of Computer & Information Science Box D 67, 78457 Konstanz, Germany [removed] Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:20 Network theory Networks Network analysis Algebraic graph theory Centrality Betweenness centrality Shortest path problem Distance Floyd–Warshall algorithm Graph theory Mathematics Theoretical computer science
17	Polynomial-time Algorithms for Enforcing Sequential Consistency in SPMD Programs with Arrays Wei-Yu Chen1 , Arvind Krishnamurthy2 , and Katherine Yelick1 1 Computer Science Division, University of California, Berkeley Add to Reading List Source URL: upc.lbl.gov Language: English - Date: 2010-05-06 00:14:41 Parallel computing Cycle detection SPMD Compiler optimization Algorithm Shortest path problem Floyd–Warshall algorithm Graph Connected component Mathematics Graph theory Theoretical computer science
18	Minimizing communication in all-pairs shortest paths Edgar Solomonik Aydin Buluc James Demmel Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2013-02-13 15:02:13 Analysis of algorithms Dynamic programming Network theory Operations research Floyd–Warshall algorithm Algorithm Semiring Shortest path problem Computational complexity theory Mathematics Theoretical computer science Applied mathematics
19	2013 IEEE 54th Annual Symposium on Foundations of Computer Science A forward-backward single-source shortest paths algorithm Uri Zwick Tel Aviv University [removed] Add to Reading List Source URL: www.dbwilson.com Language: English - Date: 2013-12-01 03:48:54 Routing algorithms Combinatorial optimization Network flow Network theory Shortest path problem Distance Graph Matching Floyd–Warshall algorithm Mathematics Graph theory Theoretical computer science
20	Matrices and graphs: Transitive closure 11 1 Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-02-24 10:41:12 Spanning tree Routing algorithms Minimum spanning tree Floyd–Warshall algorithm Shortest path problem Adjacency matrix Tree Graph Tree decomposition Graph theory Mathematics Theoretical computer science

UPDATE